Generalised entropies and asymptotic complexities of languages
نویسندگان
چکیده
• conference version: Y. Kalnishkan, V. Vovk and M. V. Vyugin. Generalised Entropy and Asymptotic Complexities of Languages. In Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, volume 4539 of Lecture Notes in Computer Science, pages 293-307, Springer 2007. — limited to two games — inaccuracies in the main result • full version accepted for publication in Information and Computation
منابع مشابه
Generalised Entropy and Asymptotic Complexities of Languages
In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generalises Lutz and Fortnow’s concepts of predictability and dimension. Then asymptotic complexities in different prediction environments are compared by describing the set of all pairs of asymptotic complexities w.r.t. different envi...
متن کاملEffects of Hall current and ion-slip on unsteady hydromagnetic generalised Couette flow in a rotating Darcian channel
Unsteady hydromagnetic generalised Couette flow of a viscous, incompressible and electrically conducting fluid between two horizontal parallel porous plates Darcian channel in the presence of a uniform transverse magnetic field taking Hall current and ion-slip into account in a rotating system is investigated. An exact solution of the governing equations is obtained by Laplace transform techniq...
متن کاملThe Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular languages and provide the following details. First, we give an robustness of p-equivalence and a logical characterization for p-equivalence. The characterization i...
متن کاملA General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
In a recent work, Kim and Barbulescu had extended the tower number field sieve algorithm to obtain improved asymptotic complexities in the medium prime case for the discrete logarithm problem on Fpn where n is not a prime power. Their method does not work when n is a composite prime power. For this case, we obtain new asymptotic complexities, e.g., Lpn(1/3, (64/9) ) (resp. Lpn(1/3, 1.88) for th...
متن کاملInequalities for Shannon entropies and Kolmogorov complexities
The paper investigates connections between linear inequalities that are valid for Shannon entropies and for Kolmogorov complexities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 237 شماره
صفحات -
تاریخ انتشار 2014